package LeetCode;

public class UniquePath {
  //pass both
  public int uniquePaths(int m, int n) {
    // Start typing your Java solution below
    // DO NOT write main() function
    if (m == 0 || n == 0)
      return 0;
    if (m == 1 || n == 1)
      return 1;

    int[][] res = new int[m][n];
    for (int i = 0; i < m; i++)
      res[i][0] = 1;
    for (int j = 0; j < n; j++)
      res[0][j] = 1;

    for (int i = 1; i < m; i++) {
      for (int j = 1; j < n; j++) {
        res[i][j] = res[i][j - 1] + res[i - 1][j];
      }
    }

    return res[m - 1][n - 1];
  }

  /**
   * @param args
   */
  public static void main(String[] args) {
    // TODO Auto-generated method stub

  }

}
